Aggregated Boolean Query Processing for Document Retrieval in Edge Computing

نویسندگان

چکیده

Search engines use significant hardware and energy resources to process billions of user queries per day, where Boolean query processing for document retrieval is an essential ingredient. Considering the huge number users large scale network, traditional mechanisms may not be applicable since they mostly depend on a centralized method. To remedy this issue, paper proposes technique aggregated in context edge computing, each sub-region network corresponds regulated by server, are evaluated distributed fashion servers. This decentralized has demonstrated its efficiency applicability problem. Experimental results two real-world datasets show that achieves high performance outperforms methods 2–3 times.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cache-based Query Processing for the Boolean Retrieval Model

We propose a new method of processing general Boolean queries utilizing previous query results stored in a result cache in a mediator architecture. A simple but noble normalization form is developed to describe keyword-based Boolean queries and the content of the result cache. We propose Boolean query processing algorithms based on this form of presentation that utilizes the result cache. We sh...

متن کامل

Cache-Based Query Processing Framework for the Boolean Retrieval Model

We propose a new method of processing general Boolean queries utilizing previous query results stored in a result cache in a mediator architecture. A simple but noble normalization form is developed to describe keyword-based Boolean queries and the content of the result cache. We propose Boolean query processing algorithms based on this form of presentation that utilizes the result cache. We sh...

متن کامل

Fuzzy Query Processing for Document Retrieval Based on GFNGMA Operators

In recent years, geometric-mean averaging operators (GMA operators) have been proposed to overcome the drawbacks of the existing T-operators and averaging operators for handling the Boolean “AND” and “OR” operations in fuzzy information retrieval. However, the GMA operators can not deal with queries represented by generalized fuzzy numbers. In this paper, we present generalized fuzzy number geo...

متن کامل

Phonetic query expansion for spoken document retrieval

We are interested in retrieving information from speech data using phonetic search. We show improvement by expanding the query phonetically using a joint maximum entropy N-gram model. The value of this approach is demonstrated on Broadcast News data from NIST 2006 Spoken Term Detection evaluation.

متن کامل

Enhancing Query Formulation for Spoken Document Retrieval

The popularity and ubiquity of multimedia associated with spoken documents has spurred a lot of research interest in spoken document retrieval (SDR) in the recent past. Beyond much effort devoted to developing robust indexing and modeling techniques for representing spoken documents, a recent line of thought targets at the improvement of query modeling for better reflecting the user’s informati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11121908